Optimal Route Based Advanced Algorithm using Hot Link Split Multi-Path Routing Algorithm
نویسندگان
چکیده
منابع مشابه
Optimal Virtual Path Routing Using a Parallel Annealed Genetic Algorithm
The coexistence of a wide range of services with different quality of service (QoS) requirements in today’s networks makes the efficient use of resources a major issue. One way of managing these resources is employing the virtual path concept. In virtual circuit oriented networks such as ATM, the overall performance of the network is strongly affected by the optimization of virtual paths. Here,...
متن کاملCluster-Based Multi-Path Routing Algorithm in Wireless Sensor Networks
Small-size and low-power sensors with sensing, signal processing and wireless communication capabilities is suitable for the wireless sensor networks. Due to the limited resources and battery constraints, complex routing algorithms used for the ad-hoc networks cannot be employed in sensor networks. In this paper, we propose node-disjoint multi-path hexagon-based routing algorithms in wireless s...
متن کاملA Multi-path Hybrid Routing Algorithm in Network Routing
The shortest path tree construction is essential in network routing, and the Dijkstra algorithm, which is a static routing algorithm, is widely used. When some links in a network have new weights, dynamic routing algorithms are more efficient than static routing algorithms. This is because the dynamic routing algorithms reduce redundancy by recomputing only the affected sections of the network ...
متن کاملPath Optimization Using Ant Colony Based Multipath Routing Algorithm
Energy efficiency is always important in wireless sensor networks. In a sensor network the nodes are present with limited energy and in each transmission nodes loss some energy. It is required to minimize the rerouting to save the energy loss. Here An algorithm for energy efficient maximally covered sensor network is presented. The initial route will be identified by the Path Selection algorith...
متن کاملPerformance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm
To support networked multimedia applications, it is important for the network to provide guaranteed quality-of-service (QoS). One way to provide such services is for the network to perform QoS routing, where the path taken must fulfill a given set of constraints. Multi-constrained path (MCP) problem refers to the problem of finding a path through a network subject to multiple additive constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Network and Information Security
سال: 2014
ISSN: 2074-9090,2074-9104
DOI: 10.5815/ijcnis.2014.08.07